Coloring Meyniel graphs in linear time
نویسندگان
چکیده
منابع مشابه
Coloring Meyniel graphs in linear time
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel graph and finds a clique of maximum size.
متن کاملLinear Coloring and Linear Graphs
Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology [9], and the framework through which it was studied, we introduce the linear coloring on graphs. We provide an upper bound for the chromatic number χ(G), for any graph G, and show that G can be linearly colored in polynomial time by proposing a simple linear coloring ...
متن کاملPrecoloring co-Meyniel graphs
The pre-coloring extension problem consists, given a graph G and a subset of nodes to which some colors are already assigned, in nding a coloring of G with the minimum number of colors which respects the pre-coloring assignment. This can be reduced to the usual coloring problem on a certain contracted graph. We prove that pre-coloring extension is polynomial for complements of Meyniel graphs. W...
متن کاملOn Linear-Time Algorithms for Five-Coloring Planar Graphs
It is well known that the vertices of a planar graph can be colored with no more than four colors [l]. However, the rather detailed proof of this fact leads to a @(n*) algorithm for determining such a coloring. To yield faster algorithms, several authors have considered generating a fivecoloring rather than a four-coloring [4]. Recently, two different approaches to five-coloring planar graphs h...
متن کاملRecognition of quasi-Meyniel graphs
We present a polynomial-time algorithm for recognizing quasi-Meyniel graphs. A hole is a chordless cycle with at least four vertices. A cap is a cycle with at least 6ve vertices, with a single chord that forms a triangle with two edges of the cycle. A graph G is quasi-Meyniel if it contains no odd hole and for some x ∈ V (G), the chord of every cap in G has x as an endvertex. Our recognition al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2005
ISSN: 1571-0653
DOI: 10.1016/j.endm.2005.06.005